On the star arboricity of hypercubes
نویسندگان
چکیده
A hypercube Qn is a graph in which the vertices are all binary vectors of length n, and two vertices are adjacent if and only if their components differ in exactly one place. A galaxy or a star forest is a union of vertex disjoint stars. The star arboricity of a graph G, sa(G), is the minimum number of galaxies which partition the edge set of G. In this paper among other results, we determine the exact values of sa(Qn) for n ∈ {2k − 3, 2 + 1, 2 + 2, 2 + 2 − 4}, i ≥ j ≥ 2. We also improve the last known upper bound of sa(Qn) and show the relation between sa(G) and square coloring.
منابع مشابه
Acircuitic directed star arboricity of planar graphs with large girth
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G is the minimum number of edge-disjoint directed star forests whose union covers all edges of G and such that the union of two such forests is acircuitic. We show that graphs with maximum average degree less than 7 ...
متن کاملOn star and caterpillar arboricity
We give new bounds on the star arboricity and the caterpillar arboricity of planar graphs with given girth. One of them answers an open problem of Gyárfás and West: there exist planar graphs with track number 4. We also provide new NP-complete problems.
متن کاملStar arboricity
A star forest is a forest all of whose components are stars. The star arboricity, st(G) of a graph G is the minimum number of star forests whose union covers all the edges of G. The arboricity, A(G), of a graph G is the minimum number of forests whose union covers all the edges of G. Clearly st(G) > A(G). In fact, Algor and Alon have given examples which show that in some cases st(G) can be as ...
متن کاملThe acircuitic directed star arboricity of subcubic graphs is at most four
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G (that is a digraph with no opposite arcs) is the minimum number of edge-disjoint directed star forests whose union covers all edges of G and such that the union of any two such forests is acircuitic. We show that e...
متن کاملOn incidence coloring and star arboricity of graphs
In this note we show that the concept of incidence coloring introduced in [BM] is a special case of directed star arboricity, introduced in [AA]. A conjecture in [BM] concerning asmyptotics of the incidence coloring number is solved in the negative following an example in [AA]. We generalize Theorem 2.1 of [AMR] concerning the star arboricity of graphs to the directed case by a slight modificat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 59 شماره
صفحات -
تاریخ انتشار 2014